Tetrahedral Trees
نویسندگان
چکیده
منابع مشابه
Tetrahedral Curves
A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM, namely he restricted to curves supported on a certain four of the six lines. We consider the general situation. We first show that starting with an arbitrary t...
متن کاملNuclear Tetrahedral Symmetry
It has been recently pointed out that atomic nuclei with tetrahedral symmetry could be encountered all over the nuclear chart. The predictions are based on a very general analysis of symmetries of the nuclear mean-field and are inspired by the group-theory considerations. The implied unique 4-fold degeneracies of the single-particle levels characteristic of tetrahedral (and/or octahedral) symme...
متن کاملTetrahedral Mesh Compression
In the last years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. No attempts have been made so far to compress tetrahedral meshes losslessly, although this is especially important for scientific applications since even moderately fine meshes consume several mega-bytes of storage. In this paper we close...
متن کاملTetrahedral and Cubic Monopoles
Using a numerical implementation of the ADHMN construction, we compute the fields and energy densities of a charge three monopole with tetrahedral symmetry and a charge four monopole with octahedral symmetry. We then construct a one parameter family of spectral curves and Nahm data which represent charge four monopoles with tetrahedral symmetry, which includes the monopole with octahedral symme...
متن کاملAggressive Tetrahedral Mesh Improvement
We present a tetrahedral mesh improvement schedule that usually creates meshes whose worst tetrahedra have a level of quality substantially better than those produced by any previous method for tetrahedral mesh generation or “mesh clean-up.” Our goal is to aggressively optimize the worst tetrahedra, with speed a secondary consideration. Mesh optimization methods often get stuck in bad local opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Spatial Algorithms and Systems
سال: 2020
ISSN: 2374-0353,2374-0361
DOI: 10.1145/3385851